منابع مشابه
Resolvability of Infinite Designs
In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t-(v, k,Λ) design with t finite, v infinite and k, λ < v is resolvable and, in fact, has α orthogonal resolutions for each α < v. We also show that, while a t-(v, k,Λ) design with t and λ finite, v infini...
متن کاملResolvability and Monotone Normality
A space X is said to be κ-resolvable (resp. almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). X is maximally resolvable iff it is ∆(X)-resolvable, where ∆(X) = min{|G| : G 6= ∅ open}. We show that every crowded monotonically normal (in short: MN) space is ω-resolvable and almost μ-resolvable, where μ = mi...
متن کاملAn infinite family of symmetric designs
In this paper, using the construction method of [3], we show that if q>2 is a prime power such that there exists an affine plane of order q -1, then there exists a ~trongly divisible 2 -«q -1)(qh -1), qh-l(q -1), qh-l) design for every h;;. 2. We show that these quasi-residual designs are embeddable, and hence establish the existence of an infinite family of symmetric 2_(qh+l_q + 1, qh, qh-l) d...
متن کاملResolvability of references in users' personal collections
Introduction. Digital library users collect, enhance and manage their online reference collections to facilitate their research tasks. These personal collections, therefore, are likely to reflect users' interests, and are representative of their profile. Understanding these collections offers great opportunities for developing personalized digital library services, such as reference recommender...
متن کاملResolvability on Continuous Alphabets
We characterize the resolvability region for a large class of point-to-point channels with continuous alphabets. In our direct result, we prove not only the existence of good resolvability codebooks, but adapt an approach based on the Chernoff-Hoeffding bound to the continuous case showing that the probability of drawing an unsuitable codebook is doubly exponentially small. For the converse par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2014
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2013.11.005